On Iterative Decoding of HDPC Codes Using Weight-Bounding Graph Operations
نویسندگان
چکیده
In this paper, we extend our work on iterative softinput soft-output (SISO) decoding of high density parity check (HDPC) codes. Edge-local complementation (ELC) is a graph operation which can be used to give structural diversity during decoding with the sum-product algorithm (SPA). We describe the specific subgraphs required for ELC to not increase the weight of the Tanner graph beyond a specified upper bound. We call this controlled operation weight-bounding ELC (WBELC). A generalized iterative SISO HDPC decoder based on SPA decoding is described, which can be configured to employ our SPA-ELC decoders, or iterative permutation decoding (SPA-PD). The latter is a state-of-the-art decoding algorithm for HDPC codes, using permutations from the automorphism group of the code. We observe performance improvements over SPA-PD when the SISO HDPC decoder is configured to use SPA-ELC in conjunction with WBELC.
منابع مشابه
Random Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes
This paper describes the application of edge-local complementation (ELC), defined for a simple bipartite graph, to a Tanner graph associated with a binary linear code, C. From a code perspective, various properties of ELC are described and discussed, mainly the special case of isomorphic ELC operations and the relationship to the automorphism group of the code, Aut(C), as well as the generaliza...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملModified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code
SUMMARY We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MD...
متن کاملEigenvalue bounds on the pseudocodeword weight of expander codes
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived. These bounds are compared with the known eigenvalue-based lower bounds on the minimum distance of expander codes. Furthermore, Tanner’s parity-oriented eigenva...
متن کامل